On ordering free groups
نویسنده
چکیده
The positive cones of the left orders on a free group can be described by their finite subsets. An algorithm is given for recognizing when a finite subset of a free group lies in a positive cone. This is used to show how one can construct a sequence of finite subsets of a positive cone whose union is the positive cone. Moreover, the method gives an overview of the positive cones of a free group. It is still an open problem whether there are positive cones which can be generated as a subsemigroup by a finite subset. © 2005 Elsevier Ltd. All rights reserved.
منابع مشابه
The effects of captioning texts and caption ordering on L2 listening comprehension and vocabulary learning
This study investigated the effects of captioned texts on second/foreign (L2) listening comprehension and vocabulary gains using a computer multimedia program. Additionally, it explored the caption ordering effect (i.e. captions displayed during the first or second listening), and the interaction of captioning order with the L2 proficiency level of language learners in listening comprehension a...
متن کاملLexBFS-Ordering in Asteroidal Triple-Free Graphs
In this paper, we study the metric property of LexBFS-ordering on AT-free graphs. Based on a 2-sweep LexBFS algorithm, we show that every AT-free graph admits a vertex ordering, called the strong 2-cocomparability ordering, that for any three vertices u v w in the ordering, if d(u; w) 2 then d(u; v) = 1 or d(v; w) 2. As an application of this ordering, we provide a simple linear time recognitio...
متن کاملMolecular model of biaxial ordering in nematic liquid crystals composed of flat molecules with four mesogenic groups.
Relative stability of uniaxial and biaxial nematic phases is analyzed in a model nematic liquid crystal composed of flat molecules of C2h symmetry with four mesogenic groups rigidly linked to the same center. The generalized effective quadrupole mean-field potential is proposed and its constants are evaluated numerically for the pair intermolecular potential based on Gay-Berne interaction betwe...
متن کاملPowers of Asteroidal Triple-free Graphs with Applications
An asteroidal triple is an independent set of three vertices in a graph such that every two of them are joined by a path avoiding the closed neighborhood of the third. Graphs without asteroidal triples are called AT-free graphs. In this paper, we show that every AT-free graph admits a vertex ordering that we call a 2-cocomparability ordering. The new suggested ordering generalizes the cocompara...
متن کاملDeux Propriétés Des Groupes De Tresses. Two Properties of Braid Groups
We describe a new algorithm for comparing braid words, and establish some order properties for the braid groups which are connected with left distributive operations. Abridged English Version. We apply to braids some tools used in the study of left distributive operations (c.f. [2]). The results deal with special decompositions of braid words. One describes a new quadratic algorithm for compari...
متن کاملLinear Orderings of Subfamilies of AT-Free Graphs
Asteroidal triple free (AT-free) graphs have been introduced as a generalization of interval graphs, since interval graphs are exactly the chordal AT-free graphs. While for interval graphs it is obvious that there is always a linear ordering of the vertices, such that for each triple of independent vertices the middle one intercepts any path between the remaining vertices of the triple, it is n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Comput.
دوره 40 شماره
صفحات -
تاریخ انتشار 2005